On threshold circuit depth
نویسنده
چکیده
منابع مشابه
Threshold Circuits of Small Majority-Depth
Constant-depth polynomial-size threshold circuits are usually classi ed according to their total depth. For example, the best known threshold circuits for iterated multiplication and division have depth four and three, respectively. In this paper, the complexity of threshold circuits is investigated from a di erent point of view: explicit AND, OR gates are allowed in the circuits, and a thresho...
متن کاملOn Circuit Complexity Classes and Iterated Matrix Multiplication
OF THE DISSERTATION On Circuit Complexity Classes and Iterated Matrix Multiplication by Fengming Wang Dissertation Director: Eric Allender In this thesis, we study small, yet important, circuit complexity classes within NC, such as ACC and TC. We also investigate the power of a closely related problem called Iterated Matrix Multiplication and its implications in low levels of algebraic complexi...
متن کاملEnergy Complexity and Entropy of Threshold Circuits
Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically more tractable than their biological counterparts. However, when such threshold circuits are designed to perform a specific computational task they usually differ in one important respect from computations in the brain: they requi...
متن کاملSimulating Threshold Circuits by Majority Circuits 1 (revised Version)
We prove that a single threshold gate with arbitrary weights can be simulated by an explicit polynomial-size depth 2 majority circuit. In general we show that a depth d threshold circuit can be simulated uniformly by a majority circuit of depth d + 1. Goldmann, H astad, and Razborov showed in 10] that a non-uniform simulation exists. Our construction answers two open questions posed in 10]: we ...
متن کاملDetecting Patterns Can Be Hard: Circuit Lower Bounds for the Pattern Matching Problem
Detecting patterns in strings and images is a fundamental and widely studied problem. Motivated by the proliferation of specialized circuits in pattern recognition tasks, we study the circuit complexity of pattern matching under two popular choices of gates: De Morgan and threshold gates. For strings of length n and patterns of length log n k ≤ n− o(n), we prove super polynomial lower bounds fo...
متن کاملThe Complexity of Computing Symmetric Functions Using Threshold Circuits
Beame, R., E. Brisson and R. Ladner, The complexity of computing symmetric functions using threshold circuits, Theoretical Computer Science 100 (1992) 2533265. This paper considers size-depth tradeoffs for threshold circuits computing symmetric functions. The size measure used is the number of connections or edges in the threshold circuits as opposed to the number of gates in the circuits. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995